# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    def reverse(self, x: int) -> int:
        INT_MIN = -2 ** 31
        INT_MAX = 2 ** 31 - 1

        rev = 0

        while x != 0:
            if rev < INT_MIN // 10 + 1 or rev > INT_MAX // 10:
                return 0

            digit = x % 10

            if x < 0 < digit:
                digit -= 10
            x = (x - digit) // 10
            rev = rev * 10 + digit

        return rev

    # 解题的方法，命名和Leetcode的保持一致即可
    def isPalindrome(self, x: int) -> bool:
        if x < 0:
            return False
        else:
            revsered_val = self.reverse(x)
            if revsered_val == x:
                return True
        return False


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (121, True),
        (-121, False),
        (10, False)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.isPalindrome(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

